A minimal partial degree $\leq {\bf O}\sp’ $

A Minimal Rk-degree

We construct a minimal rK-degree, continuum many, in fact. We also show that every minimal sequence, that is, a sequence with minimal rK-degree, must have very low descriptional complexity, that every minimal sequence is rK-reducible to a random sequence, and that there is a random sequence with no minimal sequence rK-reducible to it.

On the matrix equations U_iXV_j W_{i j} for 1 \leq i; j \leq k with i +j \leq k

On ‎T‎he Fractional Minimal Cost Flow Problem of a Belief Degree Based Uncertain Network‎

A fractional minimal cost flow problem under linear type belief degree based uncertainty is studied for the first time. This type of uncertainty is useful when no historical information of an uncertain event is available. The problem is crisped using an uncertain chance-constrained programming approach and its non-linear objective function is linearized by a variable changing approach. An illus...

A Fixed Point Free Minimal Degree

We show that there exists a Turing degree which is minimal and fixed point free.

A Random Degree with Strong Minimal Cover

We show that there exists a Martin-Löf random degree which has a strong minimal cover.